Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times
نویسندگان
چکیده
منابع مشابه
Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times
We consider a queue with renewal arrivals and n exponential servers in the Halfin-Whitt heavy traffic regime, where n and the arrival rate increase without bound, so that a critical loading condition holds. Server k serves at rate k, and the empirical distribution of k k=1 n is assumed to converge weakly. We show that very little information on the service rates is required for a routing mechan...
متن کاملRouting Technicians under Stochastic Service Times: A Robust Optimization Approach
In this research, the objective is to solve the problem of routing repair technicians to service equipment distributed in client locations. Provided a list of requests for service, we can assign any one of K technicians to service them. Each request for service includes a deadline to begin the service Wi, and an estimated service time si, decided from the diagnosis of the problem at the time of...
متن کاملEfficient Routing of Emergency Vehicles under Uncertain Urban Traffic Conditions
Emergency-vehicle drivers who aim to reach their destinations through the fastest possible routes cannot rely solely on expected average travel times. Instead, the drivers should combine this travel-time information with the characteristics of data variation and then select the best or optimal route. The problem can be formulated on a graph in which the origin point and destination point are gi...
متن کاملWeak Convergence Limits for Sojourn times in Cyclic Queues under Heavy Traffic Conditions
We consider sequences of closed cycles of exponential single-server nodes with a single bottleneck. We study the cycle time and the successive sojourn times of a customer when the population sizes go to infinity. Starting from old results on themean cycle times under heavy traffic conditions, we prove a central limit theorem for the cycle time distribution. This result is then utilised to prove...
متن کاملOptimally Efficient Simulation of Buffer Overflows in Queues with Deterministic Service Times via Impor- tance Sampling
Simply because of their rarity, the estimation of the statistics of bufer overflows in queueing systems via direct simulation is often very ezpensive in computer time. Past work on fast simulation using importance sampling has concentrated on systems with Poisson arrival processes and ezponentially distributed service times. However, in practical systems, such as ATM switches, service times are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2008
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1080.0325